Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
461	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:06 Computer science Computational complexity theory Algorithm Mathematical logic Randomized algorithm Time complexity Adversary model Distributed computing Quantum algorithm Theoretical computer science Applied mathematics Analysis of algorithms
462	On the Complexity of the Abelian Sandpile Model: Communication Complexity and Statistical Mechanics Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2013-06-19 13:03:42 Science Systems theory Bak–Tang–Wiesenfeld sandpile Abelian sandpile model Self-organized criticality Lattice Computational complexity theory L-system Complexity Self-organization Critical phenomena Physics
463	Route Search over Probabilistic Geospatial Data Yaron Kanza1, , Eliyahu Safra2 , and Yehoshua Sagiv3, 1 2 Technion—Israel Institute of Technology Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2009-05-26 06:50:03 Approximation algorithm Computational complexity theory Travelling salesman problem Statistical hypothesis testing Theoretical computer science Statistics Applied mathematics
464	Novel Properties Generated by Interacting Computational Systems Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-03-26 13:21:23 Cybernetics Structure Knowledge Complexity Emergence Emergentism Complex system Self-organization Complex adaptive system Systems Science Complex systems theory
465	CCCG 2006, Kingston, Ontario, August 14–16, 2006 On Approximate Range Searching – or – Get in Shape; Round is a Good Choice David M. Mount Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:58:52 Semigroup Computational geometry Complexity Science Structure Ethology Database theory Range searching Algebraic structures
466	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
467	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
468	On the Complexity of Numerical Analysis Eric Allender Rutgers, the State University of NJ Department of Computer Science Piscataway, NJ, USA Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2008-12-08 14:23:03 Complexity classes Polynomial Advice P Reduction Time complexity Bounded-error probabilistic polynomial Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
469	Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Add to Reading List Source URL: web.mit.edu Language: English - Date: 2013-06-23 10:21:36 Dynamical systems Stability theory Lyapunov function Lyapunov stability Quadratic Polynomial P versus NP problem Time complexity Lyapunov theory Theoretical computer science Mathematics Computational complexity theory
470	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics

UPDATE